0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n157.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 08:35:24 CST 2018
0.00/0.20	% done 3 iterations in 0.004s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff('thm/sets/LIST_OF_SET_PROPERTIES_', axiom,
0.00/0.20	  (![A:$tType,A0:(A > $o)]:
0.00/0.20	     ('const/sets/FINITE'(A,A0) =>
0.00/0.20	      (('const/lists/LENGTH'(A,'const/sets/list_of_set'(A,A0)) =
0.00/0.20	        'const/sets/CARD'(A,A0)) & 
0.00/0.20	       ('const/sets/set_of_list'(A,'const/sets/list_of_set'(A,A0)) = A0))))).
0.00/0.20	tff('0', plain,
0.00/0.20	    ![X0 : $tType, X1 : X0 > $o]:
0.00/0.20	      ('const/lists/LENGTH'(X0, 'const/sets/list_of_set'(X0, X1))
0.00/0.20	        = 'const/sets/CARD'(X0, X1)
0.00/0.20	       | ~ 'const/sets/FINITE'(X0, X1)),
0.00/0.20	    inference('cnf', [status(esa)], [thm/sets/LIST_OF_SET_PROPERTIES_])).
0.00/0.20	tff('thm/sets/LENGTH_LIST_OF_SET_', conjecture,
0.00/0.20	  (![A:$tType,A0:(A > $o)]:
0.00/0.20	     ('const/sets/FINITE'(A,A0) =>
0.00/0.20	      ('const/lists/LENGTH'(A,'const/sets/list_of_set'(A,A0)) =
0.00/0.20	       'const/sets/CARD'(A,A0))))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    (![A:$tType,A0:(A > $o)]:
0.00/0.20	       ('const/sets/FINITE'(A,A0) =>
0.00/0.20	        ('const/lists/LENGTH'(A,'const/sets/list_of_set'(A,A0)) =
0.00/0.20	         'const/sets/CARD'(A,A0)))))).
0.00/0.20	tff('1', plain,
0.00/0.20	    'const/lists/LENGTH'(sk_A, 'const/sets/list_of_set'(sk_A, sk_A0))
0.00/0.20	     != 'const/sets/CARD'(sk_A, sk_A0),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('2', plain,
0.00/0.20	    ('const/sets/CARD'(sk_A, sk_A0) != 'const/sets/CARD'(sk_A, sk_A0)
0.00/0.20	     | ~ 'const/sets/FINITE'(sk_A, sk_A0)),
0.00/0.20	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.20	tff('3', plain, 'const/sets/FINITE'(sk_A, sk_A0),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('4', plain,
0.00/0.20	    ('const/sets/CARD'(sk_A, sk_A0) != 'const/sets/CARD'(sk_A, sk_A0)
0.00/0.20	     | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['2', '3'])).
0.00/0.20	tff('5', plain, $false, inference('simplify', [status(thm)], ['4'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
